Implementation of Basic Operations for Sparse Matrices when Solving a Generalized Eigenvalue Problem in the ACELAN-COMPOS Complex

نویسندگان

چکیده

Introduction. The widespread use of piezoelectric materials in various industries stimulates the study their physical characteristics and determines urgency such research. In this case, modal analysis makes it possible to determine operating frequency coefficient electromechanical coupling elements devices. These indicators are serious theoretical applied interest. was aimed at development numerical methods for solving problem determining resonance frequencies a system elastic bodies. To achieve goal, we needed new approaches discretization based on finite element method execution software implementation selected C# .net platform. Current solutions were created context ACELAN-COMPOS class library. known generalized eigenvalue matrix inversion not applicable large-dimensional matrices. overcome limitation, presented scientific work implemented logic constructing mass matrices interfaces exchanging data problems with pre- postprocessing modules. Materials Methods. A platform used implement programming language. Validation research results carried out through comparing values found obtained well-known SAE packages (computer-aided engineering). routines evaluated terms performance applicability large-scale tasks. Numerical experiments validate algorithms small-dimensional that solved by MATLAB. Next, approach tested tasks large number unknowns taking into account parallelization individual operations. avoid finding inverse matrix, modified Lanczos programmatically implemented. We examined formats storing RAM: triplets, CSR, СSC, Skyline. solve linear algebraic equations (SLAE), an iterative symmetric LQ adapted these storage used. Results. New calculation modules integrated library complex developed. Calculations sparse RAM implementing operations structure stiffness constructed same task, but different renumbering nodes grid, graphically visualized. relation theory electroelasticity, time required perform basic summarized form table. It has been established grid gives significant increase even without changing internal memory. Taking objectives study, advantages weaknesses named. Thus, CSR optimal when multiplying vector, SKS inverting matrix. order 10 3 , won speed. evaluated. contribution all total solution measured. operation SLAE takes up 95% algorithm. When method, greatest computational costs multiply vector. algorithm, shared memory resorted to. using eight threads, gain increased 40–50%. Discussion Conclusion. as part package. Their model quasi-regular grids estimated. features structures electroelastic body, preferred processing determined.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

On the nonnegative inverse eigenvalue problem of traditional matrices

In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.

متن کامل

A Decomposition Algorithm for Sparse Generalized Eigenvalue Problem

Sparse generalized eigenvalue problem arises in a number of standard and modern statistical learning models, including sparse principal component analysis, sparse Fisher discriminant analysis and sparse canonical correlation analysis. However, this problem is difficult to solve since it is NP-hard. In this paper, we consider a new decomposition method to tackle this problem. Specifically, we us...

متن کامل

A D.C. Programming Approach to the Sparse Generalized Eigenvalue Problem

In this paper, we consider the sparse eigenvalue problem wherein the goal is to obtain a sparse solution to the generalized eigenvalue problem. We achieve this by constraining the cardinality of the solution to the generalized eigenvalue problem and obtain sparse principal component analysis (PCA), sparse canonical correlation analysis (CCA) and sparse Fisher discriminant analysis (FDA) as spec...

متن کامل

Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem

The state-of-the-art algorithms for solving the trust-region subproblem are based on an iterative process, involving solutions of many linear systems, eigenvalue problems, subspace optimization, or line search steps. A relatively underappreciated fact, due to Gander, Golub and von Matt in 1989, is that trust-region subproblems can be solved by one generalized eigenvalue problem, with no outer i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advanced engineering research

سال: 2023

ISSN: ['2687-1653']

DOI: https://doi.org/10.23947/2687-1653-2023-23-2-121-129